Algorithms for quadratic forms
نویسنده
چکیده
We present algorithms for square classes, quadratic forms and Witt classes of quadratic forms over the eld of rational functions of one variable over the reals. The algorithms are capable of: nding the unique representative of a square class, deciding if a given function is a square or a sum of squares and deciding if a quadratic form is isotropic or hyperbolic. Moreover we propose a representation for Witt classes of quadratic forms. With this representation one can manipulate Witt classes without operating directly on their coe cients. We present algorithms both for computing this representation and manipulating Witt classes.
منابع مشابه
Applications of quadratic D-forms to generalized quadratic forms
In this paper, we study generalized quadratic forms over a division algebra with involution of the first kind in characteristic two. For this, we associate to every generalized quadratic from a quadratic form on its underlying vector space. It is shown that this form determines the isotropy behavior and the isometry class of generalized quadratic forms.
متن کاملSome Probability Inequalities for Quadratic Forms of Negatively Dependent Subgaussian Random Variables
In this paper, we obtain the upper exponential bounds for the tail probabilities of the quadratic forms for negatively dependent subgaussian random variables. In particular the law of iterated logarithm for quadratic forms of independent subgaussian random variables is generalized to the case of negatively dependent subgaussian random variables.
متن کاملApproximating the Distributions of Singular Quadratic Expressions and their Ratios
Noncentral indefinite quadratic expressions in possibly non- singular normal vectors are represented in terms of the difference of two positive definite quadratic forms and an independently distributed linear combination of standard normal random variables. This result also ap- plies to quadratic forms in singular normal vectors for which no general representation is currently available. The ...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملAn analysis of the reduction algorithms for binary quadratic forms
We prove in this paper that the classical reduction algorithms for integral binary quadratic forms have quadratic running time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Comput.
دوره 43 شماره
صفحات -
تاریخ انتشار 2008